#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],tot=0;
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n;cin>>n;
   LL mod=n;
   for(LL i=1;i<=n;i++){
      if(__gcd(i,n)==1){
         a[++tot]=i;
      }
   }
   LL sum=1;
   for(LL i=1;i<=tot;i++){
      sum=(sum%mod*a[i]%mod)%mod;
   }
   if(sum!=1) tot--;
   cout<<tot<<"\n";
   for(LL i=1;i<=tot;i++){
      cout<<a[i]<<" ";
   }cout<<"\n";
   return 0;
}
